Estimates for Piecewise Quadric Approximations of Implicitly Defined Manifolds
نویسندگان
چکیده
منابع مشابه
A Family of MCMC Methods on Implicitly Defined Manifolds
Traditional MCMC methods are only applicable to distributions defined on R. However, there exist many application domains where the distributions cannot easily be defined on a Euclidean space. To address this limitation, we propose a general constrained version of Hamiltonian Monte Carlo, and give conditions under which the Markov chain is convergent. Based on this general framework we define a...
متن کاملSome Optimal Error Estimates for Piecewise Linear Finite Element Approximations
It is shown that the Ritz projection onto spaces of piecewise linear finite elements is bounded in the Sobolev space, Wp\ for 2 <p < oo. This implies that for functions in W¿ n Wp the error in approximation behaves like 0(h) in Wx, for 2 <p =c oo, and like 0(h2) in Lp, for 2 *íp < oo. In all these cases the additional logarithmic factor previously included in error estimates for linear finite e...
متن کاملImplicitly Defined Baseball Statistics
Major League Baseball uses statistics to determine awards every season. The batting champion is given to the player with the highest batting average. The Cy Young Award is given to the top pitcher which is determined by many different statistics including earned run average (ERA). Batting average and ERA have been used for many years and are major statistics in baseball. Neither batting average...
متن کاملFat Arcs for Implicitly Defined Curves
We present an algorithm generating a collection of fat arcs which bound the zero set of a given bivariate polynomial in Bernstein– Bézier representation. We demonstrate the performance of the algorithm (in particular the convergence rate) and we apply the results to the computation of intersection curves between implicitly defined algebraic surfaces and rational parametric surfaces.
متن کاملImplicitly-Defined Neural Networks for Sequence Labeling
In this work, we propose a novel, implicitlydefined neural network architecture and describe a method to compute its components. The proposed architecture forgoes the causality assumption previously used to formulate recurrent neural networks and allow the hidden states of the network to coupled together, allowing potential improvement on problems with complex, long-distance dependencies. Initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2001
ISSN: 0885-064X
DOI: 10.1006/jcom.2001.0613